Constraint-Handling Techniques C5.2 Penalty functions
نویسندگان
چکیده
This section begins with the motivation and general form of penalty functions as used in evolutionary computation. The main types of penalty function—constant, static, dynamic, and adaptive—are described within a common notation framework. References from the literature concerning these exterior penalty approaches are presented. The section concludes with a brief discussion of promising areas of future research in penalty methods for constrained optimization by evolutionary computation. C5.2.
منابع مشابه
SEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کاملA Niched-Penalty Approach for Constraint Handling in Genetic Algorithms
Kalyanmoy Deb and Samir Agrawal Kanpur Genetic Algorithms Laboratory (KanGAL), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208 016, India E-mail: deb,samira @iitk.ac.in Abstract Most applications of genetic algorithms (GAs) in handling constraints use a straightforward penalty function method. Such techniques involve penalty parameters which must be set righ...
متن کاملEvaluation of Alternative Penalty Function Implementations in a Watershed Management Design Problem
Genetic algorithms (GAs) provide a convenient framework to search for good solutions for a wide range of problems that are typically difficult to solve by means of traditional optimization techniques. Their application in solving real-world engineering problems is becoming increasingly popular. A common drawback of this procedure is its poor ability to handle constraints while searching for goo...
متن کاملHandling Constraints in Genetic Algorithms using Dominance-Based Tournaments
In this paper, we propose a constraint-handling approach for genetic algorithms which uses a dominance-based selection scheme. The proposed approach does not require the fine tuning of a penalty function and does not require extra mechanisms to maintain diversity in the population. The algorithm is validated using several test functions taken from the specialized literature on evolutionary opti...
متن کاملConstraint-handling in genetic algorithms through the use of dominance-based tournament selection
In this paper, we propose a dominance-based selection scheme to incorporate constraints into the fitness function of a genetic algorithm used for global optimization. The approach does not require the use of a penalty function and, unlike traditional evolutionary multiobjective optimization techniques, it does not require niching (or any other similar approach) to maintain diversity in the popu...
متن کامل